Perceptron type learning algorithms in nonseparable situations
نویسندگان
چکیده
منابع مشابه
Perceptron-like Algorithms and Generalization Bounds for Learning to Rank
Learning to rank is a supervised learning problem where the output space is the space of rankings but the supervision space is the space of relevance scores. We make theoretical contributions to the learning to rank problem both in the online and batch settings. First, we propose a perceptron-like algorithm for learning a ranking function in an online setting. Our algorithm is an extension of t...
متن کاملPerceptron like Algorithms for Online Learning to Rank
Perceptron is a classic online algorithm for learning a classification function. In this paper, we provide a novel extension of the perceptron algorithm to the learning to rank problem in information retrieval. We consider popular listwise performance measures such as Normalized Discounted Cumulative Gain (NDCG) and Average Precision (AP). A modern perspective on perceptron for classification i...
متن کاملOn higher-order perceptron algorithms
A new algorithm for on-line learning linear-threshold functions is proposed which efficiently combines second-order statistics about the data with the ”logarithmic behavior” of multiplicative/dual-norm algorithms. An initial theoretical analysis is provided suggesting that our algorithm might be viewed as a standard Perceptron algorithm operating on a transformed sequence of examples with impro...
متن کاملNONSEPARABLE WALSH - TYPE FUNCTIONS ON R d
We study wavelet packets in the setting of a multiresolution analysis of L2(Rd) generated by an arbitrary dilation matrix A satisfying |det A| = 2. In particular, we consider the wavelet packets associated with a multiresolution analysis with a scaling function given by the characteristic function of some set (called a tile) in Rd. The functions in this class of wavelet packets are called gener...
متن کاملPerceptron Learning of SAT
Boolean satisfiability (SAT) as a canonical NP-complete decision problem is one of the most important problems in computer science. In practice, real-world SAT sentences are drawn from a distribution that may result in efficient algorithms for their solution. Such SAT instances are likely to have shared characteristics and substructures. This work approaches the exploration of a family of SAT s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1967
ISSN: 0022-247X
DOI: 10.1016/0022-247x(67)90141-2